Search results for " COMPUTATION"
showing 10 items of 1478 documents
A Viscoelastic Model for the Long-Term Deflection of Segmental Prestressed Box Girders
2017
Most of segmental prestressed concrete box girders exhibit excessive multidecade deflections unforeseeable by past and current design codes. To investigate such a behavior, mainly caused by creep and shrinkage phenomena, an effective finite element (FE) formulation is presented in this article. This formulation is developed by invoking the stationarity of an energetic principle for linear viscoelastic problems and relies on the Bazant creep constitutive law. A case study representative of segmental prestressed concrete box girders susceptible to creep is also analyzed in the article, that is, the Colle Isarco viaduct. Its FE model, based on the aforementioned energetic formulation, was succ…
The Average State Complexity of the Star of a Finite Set of Words Is Linear
2008
We prove that, for the uniform distribution over all sets Xof m(that is a fixed integer) non-empty words whose sum of lengths is n, $\mathcal{D}_X$, one of the usual deterministic automata recognizing X*, has on average $\mathcal{O}(n)$ states and that the average state complexity of X*is i¾?(n). We also show that the average time complexity of the computation of the automaton $\mathcal{D}_X$ is $\mathcal{O}(n\log n)$, when the alphabet is of size at least three.
A class of nilpotent Lie algebras admitting a compact subgroup of automorphisms
2017
Abstract The realification of the ( 2 n + 1 ) -dimensional complex Heisenberg Lie algebra is a ( 4 n + 2 ) -dimensional real nilpotent Lie algebra with a 2-dimensional commutator ideal coinciding with the centre, and admitting the compact algebra sp ( n ) of derivations. We investigate, in general, whether a real nilpotent Lie algebra with 2-dimensional commutator ideal coinciding with the centre admits a compact Lie algebra of derivations. This also gives us the occasion to revisit a series of classic results, with the expressed aim of attracting the interest of a broader audience.
Text Compression Using Antidictionaries
1999
International audience; We give a new text compression scheme based on Forbidden Words ("antidictionary"). We prove that our algorithms attain the entropy for balanced binary sources. They run in linear time. Moreover, one of the main advantages of this approach is that it produces very fast decompressors. A second advantage is a synchronization property that is helpful to search compressed data and allows parallel compression. Our algorithms can also be presented as "compilers" that create compressors dedicated to any previously fixed source. The techniques used in this paper are from Information Theory and Finite Automata.
The promise of spintronics for unconventional computing
2021
Novel computational paradigms may provide the blueprint to help solving the time and energy limitations that we face with our modern computers, and provide solutions to complex problems more efficiently (with reduced time, power consumption and/or less device footprint) than is currently possible with standard approaches. Spintronics offers a promising basis for the development of efficient devices and unconventional operations for at least three main reasons: (i) the low-power requirements of spin-based devices, i.e., requiring no standby power for operation and the possibility to write information with small dynamic energy dissipation, (ii) the strong nonlinearity, time nonlocality, and/o…
Quantum computing thanks to Bianchi groups
2018
It has been shown that the concept of a magic state (in universal quantum computing: uqc) and that of a minimal informationally complete positive operator valued measure: MIC-POVMs (in quantum measurements) are in good agreement when such a magic state is selected in the set of non-stabilizer eigenstates of permutation gates with the Pauli group acting on it [1]. Further work observed that most found low-dimensional MICs may be built from subgroups of the modular group PS L(2, Z) [2] and that this can be understood from the picture of the trefoil knot and related 3-manifolds [3]. Here one concentrates on Bianchi groups PS L(2, O10) (with O10 the integer ring over the imaginary quadratic fie…
The diamond partial order for strong Rickart rings
2016
The diamond partial order has been first introduced for matrices, and then discussed also in the general context of *-regular rings. We extend this notion to Rickart rings, and state various properties of the diamond order living on the so-called strong Rickart rings. In particular, it is compared with the weak space preorder and the star order; also existence of certain meets and joins under diamond order is discussed.
Binary jumbled string matching for highly run-length compressible texts
2012
The Binary Jumbled String Matching problem is defined as: Given a string $s$ over $\{a,b\}$ of length $n$ and a query $(x,y)$, with $x,y$ non-negative integers, decide whether $s$ has a substring $t$ with exactly $x$ $a$'s and $y$ $b$'s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this index have running time $O(n^2/\log n)$ [Burcsi et al., FUN 2010; Moosa and Rahman, IPL 2010], or $O(n^2/\log^2 n)$ in the word-RAM model [Moosa and Rahman, JDA 2012]. We propose an index constructed directly from the run-length encoding of $s$. The construction time of our index i…
Nondeterministic operations on finite relational structures
1998
Abstract This article builds on a tutorial introduction to universal algebra for language theory (Courcelle, Theoret. Comput. Sci. 163 (1996) 1–54) and extends it in two directions. First, nondeterministic operations are considered, i.e., operations which give a set of results instead of a single one. Most of their properties concerning recognizability and equational definability carry over from the ordinary case with minor modifications. Second, inductive sets of evaluations are studied in greater detail. It seems that they are handled most naturally in the framework presented here. We consider the analogues of top-down and bottom-up tree transducers. Again, most of their closure propertie…
Avoiding strange attractors in efficient parametric families of iterative methods for solving nonlinear problems
2019
[EN] Searching zeros of nonlinear functions often employs iterative procedures. In this paper, we construct several families of iterative methods with memory from one without memory, that is, we have increased the order of convergence without adding new functional evaluations. The main aim of this manuscript yields in the advantage that the use of real multidimensional dynamics gives us to decide among the different classes designed and, afterwards, to select its most stable members. Moreover, we have found some elements of the family whose behavior includes strange attractors of different kinds that must be avoided in practice. In this sense, Feigenbaum diagrams have resulted an extremely …